A comparison of concepts from computable analysis and effective descriptive set theory
نویسندگان
چکیده
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two disciplines has so far been neglected, a situation this paper is meant to remedy. As the role of the Cauchy completion is relevant for both effective approaches to Polish spaces, we consider the interplay of effectivity and completion in some more detail.
منابع مشابه
Isomorphism and Classification for Countable Structures
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and computable structure theory, extending concepts from the latter beyond computable structures to examine the isomorphism problem on arbitrary countable struc...
متن کاملComputable Polish Group Actions
Using methods from computable analysis, we establish a new connection between two seemingly distant areas of logic: computable structure theory and invariant descriptive set theory. We extend several fundamental results of computable structure theory to the more general setting of topological group actions. Among other results, we provide a new recursion-theoretic characterization of Σ3-orbits ...
متن کاملComputability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of countable ordinals via a representation in the sense of computable analysis. The computability structure is characterized by the computability of four speci...
متن کاملRandomness via effective descriptive set theory
1.1 Informal introduction to Π1 relations Let 2N denote Cantor space. • A relation B ⊆ N × (2N)r is Π1 if it is obtained from an arithmetical relation by a universal quantification over sets. • If k = 1, r = 0 we have a Π1 set ⊆ N. • If k = 0, r = 1 we have a Π1 class ⊆ 2N. • The relation B is∆1 if both B and its complement are Π1. There is an equivalent representation of Π1 relations where the...
متن کاملILLC PhD Pilot Study
This is a proposal for a thesis in the interface of descriptive set theory and computable analysis, in a continuation of my MoL thesis [9]. There, I was interested in studying connections between game characterizations of classes of functions in descriptive set theory and the theory of Weihrauch reducibility, in particular searching for counterparts in computable analysis to the game characteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 27 شماره
صفحات -
تاریخ انتشار 2017